Proof Complexity of the Cut-free Calculus of Structures
نویسنده
چکیده
We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures). Exploiting the fact that the cut rule (i↑) of SKSg corresponds to the ¬-left rule in the sequent calculus, we establish that the “analytic” system KSg+c↑ has essentially the same complexity as the monotone Gentzen calculus MLK . In particular, KSg + c↑ quasipolynomially simulates SKSg , and admits polynomial-size proofs of some variants of the pigeonhole principle.
منابع مشابه
On the cut rule in the calculus of structures
We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures). Exploiting the fact that the so-called cut rule of SKSg does not correspond to cut in the sequent calculus, but to the ¬-left rule, we establish that the “analytic” system KSg + c↑ has essentially the same complexity as the monotone Gentzen calculus MLK . In particula...
متن کاملA On the Power of Substitution in the Calculus of Structures
There are two contributions in this paper. First, we give a direct proof of the known fact that Frege systems with substitution can be p-simulated by the calculus of structures extended with the substitution rule. This is done without referring to the p-equivalence of extended Frege systems and Frege systems with substitution. Second, we then show that the cut-free calculus of structures with s...
متن کاملExtension without cut
In proof theory one distinguishes sequent proofs with cut and cut-free sequent proofs, while for proof complexity one distinguishes Frege-systems and extended Frege-systems. In this paper we show how deep inference can provide a uniform treatment for both classifications, such that we can define cut-free systems with extension, which is neither possible with Frege-systems, nor with the sequent ...
متن کاملNon-commutativity and MELL in the Calculus of Structures
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual noncommutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its...
متن کاملMELL in the calculus of structures
Gentzen’s sequent calculus is a tool to study properties of logics independently of semantics. The main property is cut-elimination which entails the subformula property and consistency. It is also the basis of methods of automated deduction. Although the sequent calculus is very appropriate for classical logic, it raises some concerns in dealing with more refined logics like linear logic. An e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 2009